RDF Subgraph Query Based on Common Subgraph in Distributed Environment

With the gradual development of network, RDF graphs have become more and complex as scale data increases; how to perform effective query for massive is a hot topic continuous research. The traditional methods graph traversal produce great redundancy intermediate results, processing subgraph collection queries in stand-alone mode cannot efficient matching when amount extremely large. Moreover, queries, it necessary iterate multiple times common subgraph, execution efficiency not high. In response above problems, distributed strategy set based on composite relation tree proposed. Firstly, corresponding relationship established set, then clipped, redundant nodes edges are deleted obtain tree. Finally, using tree, MapReduce-based method proposed, which can use parallel computing environment, batch performed result obtained by traversing experimental results show that algorithm proposed this paper improve set.